A New Approach to Formal Language Theory by Kolmogorov Complexity
نویسندگان
چکیده
منابع مشابه
A New Approach to Formal Language Theory by Kolmogorov Complexity
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate deterministic context-free languages and nondeterministic context-free languages. The use of the new ‘incompressibility arguments’ is illustrated by many examples. The ...
متن کاملKolmogorov Complexity as a Language
The notion of Kolmogorov complexity (=the minimal length of a program that generates some object) is often useful as a kind of language that allows us to reformulate some notions and therefore provide new intuition. In this survey we provide (with minimal comments) many different examples where notions and statements that involve Kolmogorov complexity are compared with their counterparts not in...
متن کاملComplexity Theory Made Easy The Formal Language Approach to the Definition of Complexity Classes
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said to be accepted if in the corresponding computation tree an accepting path exists, more general conditions on this tree are used. We survey some recent results from this context, paying particular attention to nondeterm...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولA Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are “compatible”. Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to apply the defining diagrams of algebras, coalgebras, and bialgebras to categories of semimodules and semimodule homomorphisms over a commutative semiring. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1995
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s009753979324485x